bool AddQ( Queue Q, ElementType X ){
	int rear;
	if(Q->Count==Q->MaxSize){
		printf("Queue Full\n");
		return false;
	}
	rear=(Q->Front+Q->Count)%Q->MaxSize;
	Q->Data[rear]=X;
	Q->Count++;
	return true;
} 
ElementType DeleteQ( Queue Q ){
	int m,rear;
	if(Q->Count==0){
		printf("Queue Empty\n");
		return ERROR;
	}
	m=Q->Data[Q->Front];
	Q->Front=(Q->Front+1)%Q->MaxSize;
	Q->Count--;
	return m;
}
